skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Benford, Alistair"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Proceedings of the American Mathematical Society)
    We prove a strong dichotomy result for countably-infinite oriented graphs; that is, we prove that for all countably-infinite oriented graphs G G , either (i) there is a countably-infinite tournament K K such that G ⊈ K G\not \subseteq K , or (ii) every countably-infinite tournament contains aspanningcopy of G G . Furthermore, we are able to give a concise characterization of such oriented graphs. Our characterization becomes even simpler in the case of transitive acyclic oriented graphs (i.e. strict partial orders). For uncountable oriented graphs, we are able to extend the dichotomy result mentioned above to all regular cardinals κ<#comment/> \kappa ; however, we are only able to provide a concise characterization in the case when κ<#comment/> = ℵ<#comment/> 1 \kappa =\aleph _1 . 
    more » « less
    Full Text Available